A Domain-Specific Language for Generating Dataflow Analyzers

Dataflow analysis is a well-understood and very powerful technique for analyzing programs as part of the compilation process. Virtually all compilers use some sort of dataflow analysis as part of their optimization phase. However, despite being well-understood theoretically, such analyses are often difficult to code, making it difficult to quickly experiment with variants.To address this, we developed a domain-specific language, Analyzer Generator (AG), that synthesizes dataflow analysis phases for Microsoft's Phoenix compiler framework. AG hides the fussy details needed to make analyses modular, yet generates code that is as efficient as the hand-coded equivalent. One key construct we introduce allows IR object classes to be extended without recompiling.Experimental results on three analyses show that AG code can be one-tenth the size of the equivalent handwritten C++ code with no loss of performance. It is our hope that AG will make developing new dataflow analyses much easier.     

APGAN and RPMC: Complementary Heuristics for Translating DSP Block Diagrams into Efficient Software Implementations

Dataflow has proven to be an attractive computational model for graphical DSP design environments that support the automatic conversion of hierarchical signal flow diagrams into implementations on programmable processors. The synchronous dataflow (SDF) model is particularly well-suited to dataflow-based graphical programming because its restricted semantics offer strong formal properties and significant compile-time predictability, while capturing the behavior of a large class of important signal processing applications. When synthesizing software for embedded signal processing applications, critical constraints arise due to the limited amounts of memory. In this paper, we propose a solution to the problem of jointly optimizing the code and data size when converting SDF programs into software implementations.We consider two approaches. The first is a customization to acyclic graphs of a bottom-up technique, called pairwise grouping of adjacent nodes (PGAN), that was proposed earlier for general SDF graphs. We show that our customization to acyclic graphs significantly reduces the complexity of the general PGAN algorithm, and we present a formal study of our modified PGAN technique that rigorously establishes its optimality for a certain class of applications. The second approach that we consider is a top-down technique, based on a generalized minimum-cut operation, that was introduced recently in [14]. We present the results of an extensive experimental investigation on the performance of our modified PGAN technique and the top-down approach and on the trade-offs between them. Based on these results, we conclude that these two techniques complement each other, and thus, they should both be incorporated into SDF-based software implementation environments in which the minimization of memory requirements is important. We have implemented these algorithms in the Ptolemy software environment [5] at UC Berkeley.     

我国东部地区污水处理设施技术指南调研

对我国东部地区沪、浙、苏、粤等地若干代表性城市(镇)污水处理设施技术指南的制定和执行情况进行了调研,发现东部地区污水处理设施技术指南的制定和执行情况不容乐观,污水处理工程缺乏系统性,导致管网建设、处理工艺选择及运行管理等都存在一定的问题。     

欧共体承压设备指令(97/23/EC)简介

简要介绍欧共体承压设备指令（97／23／EC简称PED）CE标志认证的主要内容及企业执行认证需要完成的主要工作。     

Relations among Security Models for Authenticated Key Exchange

Usually, key‐establishment protocols are suggested in a security model. However, there exist several different security models in the literature defined by their respective security notions. In this paper, we study the relations between the security models of key establishment. For the chosen security models, we first show that some proven key‐establishment protocols are not secure in the more restricted security models. We then suggest two compilers by which we can convert a key‐establishment protocol that is secure in a specific security model into a key‐establishment protocol that is still secure in a more restricted security model.     

Deriving correctness properties of compiled code

When developing safety-critical software, it is the correctness of the object code that is paramount. However, it is desirable to perform formal verification on the source program. To ensure that correctness results proved about the source program do apply to the object code, the compiler used can be formally verified. However, care must be taken to ensure that the compiler correctness theorem proved is suitable. We have combined a derived programming logic with a verified compiler for a generic subset of the Vista structured assembly language. We show how correctness properties of object code can be formally derived from corresponding correctness properties of the source program which have been proved using the programming logic. Thus we can be sure the results do apply to the object code. The work described has been performed using the HOL system and so is machine-checked.     

Macrodiversity analysis of anM-ary noncoherent orthogonal DS/CDMA system on shadowed Rayleigh channels

DS/CDMA noncoherentM-ary orthogonal signaling is presented in a hexagonal cell with three and six corner-based antennas. Multipath Rayleigh channel with lognormal shadowing and perfect power control are assumed. The asynchronous case (uplink) is studied. Bit error rate analysis is carried out to investigate the benefits of combining theM-ary orthogonal signaling and macrodiversity techniques either with uncorrelated or correlated base stations. Comparative analysis between the one central antenna arrangement and the proposed one is presented. The results show that the combination ofM-ary signaling with multiple corner-based antennas improves system performance especially in terms of accommodating more users and supporting new services. The results also show that shadowing does not degrade system performance significantly.     

龙门式电火花线切割译码仿真程序设计

研究了龙门式电火花线切割译码仿真程序，构架了程序框架。对编译模块进行了细分，对仿真模块的层次结构及核心技术的实现做了详细介绍。介绍了二维工件、三维工件刀补的过程。     

Transposition of the EU cogeneration directive: A vision for Portugal

The potential for new, small-scale and micro-cogeneration installations in Portugal is very considerable due to the number of potential host buildings. In this work, we discuss the legal framework of the Portuguese energy market, and some modifications to accommodate the Directive, 2004/8/EC are stressed. A practical case of cogeneration is also presented, showing the application of the Annex III (b) and (c) of the Cogeneration Directive. The practical case presented shows that micro CHP can be considered highly efficient, with parameters calculated with the Directive rules. Two main improvements in Portugal's energy policy are important: improvement on the permission to access grid system and improvement on support mechanisms indexing it to PES. The Cogeneration Directive transposition is an excellent opportunity to induce a less restrictive framework for the installation of new cogeneration systems, reducing the technological barriers, namely allowing medium-voltage connection with the grid, and improving the revenues provided from these small cogeneration systems. These modifications can improve significantly the number of potential hosts for small-scale cogeneration systems.     

YH-2C语言优化编译器的设计

Ｃ语言优化编译器是借助于微机上的Ｉｎｔｅｌ８０３８６Ｃ语言编译器为研制平台，采用交叉编译的方法设计实现的，它是我国自行设计的第一个从底层开发实现的巨型机Ｃ语言编译器。本文首先给出了ＹＨ－２Ｃ语言优化编译器的设计原理，然后详细介绍了其主要系统组成和技术特点，最后指出了我们以后进一步要做的工作